AN EFFICIENT BRANCH-AND-CUT ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION
نویسندگان
چکیده
منابع مشابه
Submodular Function Maximization
Submodularity is a property of set functions with deep theoretical consequences and far– reaching applications. At first glance it appears very similar to concavity, in other ways it resembles convexity. It appears in a wide variety of applications: in Computer Science it has recently been identified and utilized in domains such as viral marketing (Kempe et al., 2003), information gathering (Kr...
متن کاملEfficient Submodular Function Maximization under Linear Packing Constraints
We study the problem of maximizing a monotone submodular set function subject to linear packing constraints. An instance of this problem consists of a matrix A ∈ [0, 1]m×n, a vector b ∈ [1,∞)m, and a monotone submodular set function f : 2 → R+. The objective is to find a set S that maximizes f(S) subject to AxS ≤ b. Here, xS stands for the characteristic vector of the set S. A well-studied spec...
متن کاملRobust Monotone Submodular Function Maximization
Instances of monotone submodular function maximization with cardinality constraint occur often in practical applications. One example is feature selection in machine learning, where in many models, adding a new feature to an existing set of features always improves the modeling power (monotonicity) and the marginal benefit of adding a new feature decreases as we consider larger sets (submodular...
متن کاملInterleaved Algorithms for Constrained Submodular Function Maximization
We present a combinatorial algorithm that improves the best known approximation ratio for monotone submodular maximization under a knapsack and a matroid constraint to 1−e −2 2 . This classic problem is known to be hard to approximate within factor better than 1− 1/e. We show that the algorithm can be extended to yield a ratio of 1−e −(k+1) k+1 for the problem with a single knapsack and the int...
متن کاملSubmodular Function Maximization for Group Elevator Scheduling
We propose a novel approach for group elevator scheduling by formulating it as the maximization of submodular function under a matroid constraint. In particular, we propose to model the total waiting time of passengers using a quadratic Boolean function. The unary and pairwise terms in the function denote the waiting time for single and pairwise allocation of passengers to elevators, respective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2020
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.63.41